منابع مشابه
Memory efficient Self - Stabilizing k - Independent Dominating
We propose a memory efficient self-stabilizing protocol building k-independent dominating sets. A k-independent dominating set is a k-independent set and a kdominating set. A set of nodes, I, is k-independent if the distance between any pair of nodes in I is at least k + 1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silen...
متن کاملEfficient (j, k)-domination
A dominating set S of a graph G is called efficient if |N [v]∩S| = 1 for every vertex v ∈ V (G). That is, a dominating set S is efficient if and only if every vertex is dominated exactly once. In this paper, we investigate efficient multiple domination. There are several types of multiple domination defined in the literature: k-tuple domination, {k}-domination, and k-domination. We investigate ...
متن کاملThe barycenters of the k-additive dominating belief functions & the pignistic k-additive belief functions
In this paper, we consider the dominance properties of the set of the pignistic k-additive belief functions. Then, given k, we conjecture the shape of the polytope of all the k-additive belief functions dominating a given belief function, starting from an analogy with the case of dominating probability measures. Under such conjecture, we compute the analytical form of the barycenter of the poly...
متن کاملGeometry of the set of dominating k-additive belief functions
In this paper we introduce a novel, simpler form of the polytope of inner Bayesian approximations of a belief function, or “consistent probabilities”. We prove that the set of vertices of this polytope is generated by all possible permutations of elements of the domain, mirroring a similar behavior of outer consonant approximations. An intriguing connection with the behavior of maximal outer co...
متن کاملMemory Efficient Self-Stabilizing k-Independent Dominating Set Construction
We propose a memory efficient self-stabilizing protocol building k-independent dominating sets. A k-independent dominating set is a k-independent set and a kdominating set. A set of nodes, I, is k-independent if the distance between any pair of nodes in I is at least k + 1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2355